The Multi-Depot Traveling Purchaser Problem with Shared Resources

Solving the asymmetric traveling purchaser problem

The Asymmetric Traveling Purchaser Problem (ATPP) is a generalization of the Asymmetric Traveling Salesman Problem with several applications in the routing and the scheduling contexts. This problem is defined as follows. Let us consider a set of products and a set of markets. Each market is provided with a limited amount of each product at a known price. The ATPP consists in selecting a subset ...

Heuristics for the traveling purchaser problem

This article deals with two versions of the traveling purchaser problem. In the uncapacitated version, the number of units of a given product available at any market where it is sold is either larger than or equal to the demand. In the capacitated version, the availability may be smaller than the demand. This study extends some known heuristics and presents some new ones capable of solving eith...

Improved solutions for the traveling purchaser problem

ÐThe traveling purchaser problem (TPP) is an interesting generalization of the well-known traveling salesman problem (TSP), in which a list of commodity items have to be purchased at some markets selling various commodities with di€erent prices, and the total travel and purchase costs must be minimized. Applications include the purchase of raw materials for the manufacturing factories in which ...

The Traveling Purchaser Problem with time-dependent quantities

The Traveling Purchaser Problem (TPP) looks for a tour visiting a subset of markets to satisfy a positive discrete demand for some products at minimum traveling and purchasing costs. The problem is known to be NP-hard in the strong sense, and finds application in different real contexts. Frequently, as a static problem, the TPP lacks of realism: different purchasers may compete for the same res...

Multi-Component Efficiency with Shared Resources in Commercial Banks